Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses
نویسندگان
چکیده
منابع مشابه
Predicting Maximum Data Staleness in Real-Time Warehouses
This paper presents an analysis technique for estimating maximum data staleness in a data warehouse that collects “near-real-time” data streams. Data is pushed to the warehouse from a variety of external sources with a wide range of inter-arrival times (e.g., once a minute to once a day). In prior work, ad hoc heuristic algorithms have been proposed for scheduling warehouse updates. In this pap...
متن کاملOnline Scheduling to Minimize Average Stretch
We consider the classical problem of online job scheduling on uniprocessor and multiprocessor machines. For a given job, we measure the quality of service provided by an algorithm by the stretch of the job, which is defined as the ratio of the amount of time that the job spends in the system to the processing time of the job. For a given sequence of jobs, we measure the performance of an algori...
متن کاملIncremental ETL Pipeline Scheduling for Near Real-Time Data Warehouses
We present our work based on an incremental ETL pipeline for on-demand data warehouse maintenance. Pipeline parallelism is exploited to concurrently execute a chain of maintenance jobs, each of which takes a batch of delta tuples extracted from source-local transactions with commit timestamps preceding the arrival time of an incoming warehouse query and calculates Ąnal deltas to bring relevant ...
متن کاملEpsilon Equitable Partition: On Scheduling Data Loading and View Maintenance in Soft Real-time Data Warehouses
Data warehouses contain historic data providing information for analytical processing, decision making and data mining tools. However, several business intelligence applications nowadays require access to real-time data to make sound decisions. As a consequence, there is a great demand to incorporate new data from sources to the data warehouse as fast as possible. That motivates the constructio...
متن کاملReal-time scheduling to minimize machine busy times
We consider power-aware scheduling problems where the power consumption of a machine is assumed to be proportional to the time it is in on state, also called its busy-time. In our model, the jobs have release times, deadlines and processing times. Assuming that each machine can process multiple jobs simultaneously, the goal is to schedule all jobs non-preemptively in their release-time-deadline...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2011
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-011-9347-2